A Square Root Map on Sturmian Words
نویسندگان
چکیده
منابع مشابه
A Square Root Map on Sturmian Words
We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope α, there exists exactly six minimal squares in its language (a minimal square does not have a square as a proper prefix). A Sturmian word s of slope α can be written as a product of these six minimal squares: s = X2 1X 2 2X 2 3 · · · . The square root of s is defined to be the word √ s = X1...
متن کاملA note on Sturmian words
We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
متن کاملOn Minimal Sturmian Partial Words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by pw(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with ...
متن کاملPalindromes in Sturmian Words
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.
متن کاملOn the Index of Sturmian Words
An innnite word x has nite index if the exponents of the powers of primitive words that are factors of x are bounded. F. Mignosi has proved that a Sturmian word has nite index if and only if the coeecients of the continued fraction development of its slope are bounded. Mignosi's proof relies on a delicate analysis of the approximation of the slope by rational numbers. We give here a proof based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6074